| 翻訳と辞書 |
| Peterson–Gorenstein–Zierler algorithm ： ウィキペディア英語版 |
BCH code
In coding theory, the BCH codes form a class of cyclic error-correcting codes that are constructed using finite fields. BCH codes were invented in 1959 by French mathematician Alexis Hocquenghem, and independently in 1960 by Raj Bose and D. K. Ray-Chaudhuri. The acronym ''BCH'' comprises the initials of these inventors' names.
One of the key features of BCH codes is that during code design, there is a precise control over the number of symbol errors correctable by the code. In particular, it is possible to design binary BCH codes that can correct multiple bit errors. Another advantage of BCH codes is the ease with which they can be decoded, namely, via an algebraic method known as syndrome decoding. This simplifies the design of the decoder for these codes, using small low-power electronic hardware.
BCH codes are used in applications such as satellite communications,〔(【引用サイトリンク】url=http://ipnpr.jpl.nasa.gov/progress_report/42-94/94V.PDF )〕 compact disc players, DVDs, disk drives, solid-state drives〔(【引用サイトリンク】url=http://www.sandforce.com/index.php?id=133&parentId=2&top=1 )〕 and two-dimensional bar codes.
== Definition and illustration ==
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「BCH code」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|